Immunizing Conic Quadratic Optimization Problems Against Implementation Errors
نویسندگان
چکیده
منابع مشابه
Immunizing conic quadratic optimization problems against implementation errors
We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints. To prove this result we first derive a sharper result for the S-lemma in case the two matrices involved can be simultaneously diagonalized. This extension of the S-lemma may also be useful for other purposes. We extend the result to...
متن کاملRobust Solutions of Conic Quadratic Problems
I would like to thank Prof. Ben-Tal and Prof. Nemirovski for their guidance and quick response in every issue. Special thanks are attributed to Dr. Amir Beck for his help and constructive remarks. The listening ear and helping hand of the IE&M faculty academic staff, administrative staff and students are highly appreciated. And last but certainly not least, I am grateful for the support of my w...
متن کاملGlobal Quadratic Optimization via Conic Relaxation
We present a convex conic relaxation for a problem of maximizing an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12 37 -relative accuracy of the approximation. In the second part of the paper we derive the conic relaxation by another approach based on the second order optimality conditions. We show that ...
متن کاملRobust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
Abstract. We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U . The robust counterpart of such a problem leads usually to an NP-hard semidefinite problem; this is the case, for example, when U is given as the intersection of ellipsoids or as an n-dimensional box. For these cases we...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2011
ISSN: 1556-5068
DOI: 10.2139/ssrn.1853320